Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels’ Statistics are Uncertain

Almost universal codes for MIMO wiretap channels

Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information theoretically secure codes over such channels remains as an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. We extend the flatness factor criterion...

Strongly universal hashing and identification codes via channels

This paper shows that-almost strongly universal classes of hash functions can yield better explicit constructions of identiication codes via channels (ID codes) and identiication plus transmission codes (IT codes) than the previous explicit constructions of Verd u and Wei.

Conditional weighted universal source codes: second order statistics in universal coding

We consider the use of second order statistics in two-stage universal source coding. (Examples of two-stage universal codes include the weighted universal vector quantization (WWQ) 12, 3, 41, weighted universal bit allocation (WUBA) [5, 41, and weighted universal transform coding (WUTC) [6, 41 algorithms.) The second order statistics are incorporated in two-stage universal source codes in a man...

Polar Codes for Channel and Source Coding

Polar codes, introduced recently by Arıkan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking. We discuss several techniques through which their finite-length performan...

Universal Hashing and Authentication Codes